Performance Metrics for State-Based Imitation Learning
نویسندگان
چکیده
منابع مشابه
Performance and Population State Metrics for Rule-based Learning Systems
We distinguish two types of metric for the evaluation of rule-based learning systems: performance metrics are derived from the feedback to the learning agent from its teacher or environment, while population state metrics are derived from inspection of the rule base used for decision making. We propose novel population state metrics for use with learning classifier systems, evaluate them using ...
متن کاملState Aware Imitation Learning
Imitation learning is the study of learning how to act given a set of demonstrations provided by a human expert. It is intuitively apparent that learning to take optimal actions is a simpler undertaking in situations that are similar to the ones shown by the teacher. However, imitation learning approaches do not tend to use this insight directly. In this paper, we introduce State Aware Imitatio...
متن کاملLearning a Visual State Representation for Generative Adversarial Imitation Learning
Imitation learning is a branch of reinforcement learning that aims to train an agent to imitate an expert’s behaviour, with no explicit reward signal or knowledge of the world. Generative Adversarial Imitation Learning (GAIL) is a recent model that performs this very well, in a data-efficient manner. However, it has only been used with low-level, low-dimensional state information, with few resu...
متن کاملActive Imitation Learning via State Queries
We consider the problem of active imitation learning. In passive imitation learning, the goal is to learn a target policy by observing full trajectories of it. Unfortunately, generating such trajectories requires substantial effort and can be impractical in some cases. Active imitation learning reduces this effort by querying the teacher about individual states. Given such a query, the teacher ...
متن کاملExtracting state-based performance metrics using asynchronous iterative techniques
Solution of large sparse linear fixed-point problems lies at the heart of many important performance analysis calculations. These calculations include steady-state, transient and passage-time computations in discrete-time Markov chains, continuous-time Markov chains and semi-Markov chains. In recent years, much work has been done to extend the application of asynchronous iterative solution meth...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The International FLAIRS Conference Proceedings
سال: 2021
ISSN: 2334-0762
DOI: 10.32473/flairs.v34i1.128479